Symmetry in Shannon's Noiseless Coding Theorem
نویسنده
چکیده
Statements of Shannon’s Noiseless Coding Theorem by various authors, including the original, are reviewed and clarified. Traditional statements of the theorem are often unclear as to when it applies. A new notation is introduced and the domain of application is clarified. An examination of the bounds of the Theorem leads to a new symmetric restatement. It is shown that the extended upper bound is an acheivable upper bound, giving symmetry to the theorem. The relation of information entropy to the physical entropy of Gibbs and Boltmann is illustrated. Consequently, the study of Shannon Entropy is strongly related to physics and there is a physical theory of information. This paper is the beginning of of an attempt to clarify these relationships.
منابع مشابه
A New Proof of the Quantum Noiseless Coding Theorem
We give an account of the quantum noiseless coding theorem, including a new proof based on a simpliied block coding scheme. We also discuss an illustrative example of quantum coding.
متن کاملNoiseless coding theorem proved by induction for finite stationary memoryless information sources
Noiseless coding theorem for finite stationary memoryless information sources is proved by using induction on the number of source symbols and the inequality of geometric and harmonic means.
متن کاملSome Noiseless Coding Theorem Connected with Havrda and Charvat and Tsallis’s Entropy
A new measure Lα, called average code word length of order α and type β has been defined and its relationship with a result of generalized Havrda and Charvat and Tsallis’s entropy has been discussed. Using Lα, some coding theorem for discrete noiseless channel has been proved.
متن کاملSecond-order noiseless source coding theorems
I. Kontoyiannis Appeared in IEEE Trans. Inform. Theory, 43, pp. 1339 1341, July 1997. Abstract { Shannon's celebrated source coding theorem can be viewed as a \one-sided law of large numbers." We formulate second-order noiseless source coding theorems for the deviation of the codeword lengths from the entropy. For a class of sources that includes Markov chains we prove a \one-sided central limi...
متن کاملStationary quantum source coding
In this paper the quantum version of the source coding theorem is obtained for a completely ergodic source. This result extends Schumacher’s quantum noiseless coding theorem for memoryless sources. The control of the memory effects requires some earlier results of Hiai and Petz on high probability subspaces. Our result is equivalently considered as a compression theorem for noiseless stationary...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1010.6247 شماره
صفحات -
تاریخ انتشار 2010